Digital innovation Award sponsored by mobbra - mass fan engagement at live events Wireless connectivity at major sporting and entertainment events is extremely difficult to achieve due to network congestion associated w

Source URL: www.nextgenevents.co.uk

• Software
• Computing
• Computer architecture
• Smartphones
• Personal computing
• Cloud clients
• Mobile software
• Mobile technology
• Adaptxt
• Mobile app
• Tablet computer
• Windows Phone

Learning stick-figure models using nonparametric Bayesian priors over trees Edward W. Meeds, David A. Ross, Richard S. Zemel, and Sam T. Roweis Department of Computer Science University of Toronto {ewm, dross, zemel, row

Source URL: www.cs.toronto.edu

• Statistics
• Probability
• Statistical theory
• Probability distributions
• Statistical models
• Bayesian statistics
• Stochastic processes
• Graphical models
• Bayesian network
• Gibbs sampling
• Dirichlet process
• Mixture model

155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver

Source URL: www.math.uiuc.edu

• Mathematics
• Graph theory
• Discrete mathematics
• Edsger W. Dijkstra
• Routing algorithms
• Operations research
• Network theory
• Shortest path problem
• Dynamic programming
• Distance
• Path
• Linear programming

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal

LNCSEfficient Dynamic Aggregation

Source URL: webee.technion.ac.il

• Graph theory
• Mathematics
• Computational complexity theory
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Minimum spanning tree
• Network flow
• Dynamic programming

Ośrodek KSU nrEnterprise Europe Network przy Izbie Przemysłowo-Handlowej w Krakowie zaprasza do udziału w szkoleniu nt.:

Source URL: www.iph.krakow.pl

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

Source URL: www.dcg.ethz.ch

• Graph theory
• Mathematics
• Network theory
• Routing algorithms
• Edsger W. Dijkstra
• Spanning tree
• Bipartite graphs
• Shortest path problem
• Tree
• Graph
• Geographic routing
• Routing

x p e r t . n e t w o r k R a d i o s t a t i o n e n xpert.network Das erste B2B-Branchenportal

Source URL: medianet.at

Using the channel profile analysis tool, built by the University of Edinburgh Land Surface Dynamics group Part A: Extracting the channel network from a DEM Simon M. Mudd, Mikaël Attal, David T. Milodowski, Stuart W.D. G

Source URL: csdms.colorado.edu

• Computer graphics
• Computing
• Graphics file formats
• USGS DEM
• United States Geological Survey
• Portable Document Format
• ArcMap
• Software

usinggraphcuts_in_gpus_for_color_based_human_skin_segmentation_revision

Source URL: www.gcg.ufjf.br

• Graph theory
• Mathematics
• Network flow
• Computer vision
• Image segmentation
• Search algorithms
• Edsger W. Dijkstra
• Graph cuts in computer vision
• Maximum flow problem
• Watershed
• Flow network
• Pushrelabel maximum flow algorithm